The engineers had to know the depth profile of the route to estimate the length of cable that had to be manufactured. 工程师们必须要知道路的深度(纵向)剖面,才能够估计将要造的电缆的长度。
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. 许多认知研究表明,路径指令的复杂性和形式在人类导航中和路径的长度一样重要。
A new method which computes remote routing based on the border routers, was presented and finds the appropriate route by comparing the length of routing. 提出了一种基于边界路由器的远程路由计算和查找方法,以边界路由器为核心计算远程路由信息,查找时通过路径长度比较实现最短路径的选择。
The test results indicate that the proposed algorithm has more advantages than that of the fore mentioned algorithm in vehicle number, route length, route time, and computational speed for MDVRPMC. 实验结果表明:自适应的最大-最小蚁群算法在车辆数、路径长度、路径时间和计算速度方面具有优势。
When the vehicle number is confirmed, it can get the aim of optimal solution on both route length and vehicle number, thus greatly improving the results and speed of the optimization. 特别是在确定车辆数时,实现了VRPTW的路径长度和车辆数的同时优化,改善了优化结果,提高了优化速度。
Issues on the Route Length of Long Distance Pipeline Research on the EHV long-line fault locating 长输管道线路的长度确定超高压长线路故障测距研究
Based on the rule and the algorithm, the deviation of plane line can be decomposed into lateral deviation and longitudinal deviation based on route's direction. the run length compression method is suitable for binary images. 分析论证了基于判定准则及步长压缩摆动趋近法,即将公路平面线形偏差分解为垂直于路线方向的横向偏差以及沿路线方向的纵向偏差;而对于二值化图像,步长压缩算法是非常理想的。
Wiring of cables is an important step in layout design of electro-mechanical products. Its task is to determine the wiring information of cables, including the route, length, weight of cables, and the position of supports. 电缆布线是机电产品布局设计中研究的重要问题之一,其主要任务是确定电缆路径、长度和重量以及路径中的卡箍位置等布线信息。
With the condition of single distributing time and manipulator are fixed, the distributing efficiency of the automatic medicine distribution system of prescription particle of traditional Chinese medicine is decided by the accessing route length of manipulator. 在单次下药时间和机械手的运动速度固定的情况下,中药配方颗粒自动发药机系统的发药效率主要是由机械手的取药路径长度来决定。
An Anonymous Communication Protocol Based on Groups with Definite Route Length 基于组群的有限路长匿名通信协议
Communication Route Length Research in Hypercube 超立方体拓扑结构中通信传输路由长度的研究
This paper presents an Actual Route Length Calculating Method combined with genetic algorithms to search for the best result of facility layout, during the applying the genetic algorithms to get fitness function in facility layout problems. 本文提出实际路线运算法结合基因算法来求解最优设备布局结果,利用遗传算法探索生产车间设备布局问题时适值函数的确定方法。
The route symmetry is related to route length, host pairs with longer route have lower route symmetry degree. 路由对称性与路由长度有关,较长路由长度的主机对AS级路由对称程度较低。
Methods In eighteen specimens from cadaver, we dissected the ter-minal portion of the dorsal interosseous nerve for its route, branches, location, diameter, length, bundle branch and its relations with the fibrous girdle of the wrist. 方法2倍放大镜下解剖骨间背侧神经终末节的分支、行程、直径、长度、束支、与周围组织的关系以及腕关节活动对其影响。
Railway Network Route Length Calculation Program with Visual FoxPro 6.0 Program Software 在VFP6.0中实现铁路路网里程计算
Floyd algorithm is the most important algorithm in solving the shortest route problem in networks. It uses route length matrix and footpath ma-trix to obtain the solution of shortest route between any pair of points by method of iteration. FLOYD算法是求解网络最短路问题中的一个最重要的算法,该算法在求解过程中以路长矩阵和路径矩阵为工具,通过逐次迭代最终可求得任意点对间的最短路。
Dynamic User Optimal Route Choice Model Considering the Length of Vehicle Queue 考虑车辆排队长度的动态用户最优路径选择模型研究
The paper describes the basic principle and the Dijkstra algorithm concerning the calculation of the railway network route length. 概述了Dijkstra关于铁路路网里程计算的基本原理与算法。
The Calculating Method for the Actual Route Length of Facility Layout 关于设备布局的最短路径算法模型
The balanced route of load-deflection is traced, utilizing constant arc length method. 采用弧长法对张弦穹顶结构荷载-位移全过程的平衡路径进行跟踪。
On this basis, it is particularly discussed about how to calculate the beeline route length between one base point and another, one base point and one ordinary point, between two ordinary points, and between two ordinary points on the same baseline. 并以此为基础,对基点与基点、基点与普通点、普通点与普通点,同条基线上的两个普通点间如何计算最短路径里程,进行了详细的论述与论证。
The paper also studies the different simplify principles from traditional map synthesis, that is, releases the veracities of route geometry elements such as length and angle for the sake that the relative user's task cognitive informations are displayed with clarity and legible on the limited screen; 研究不同于传统制图综合原则的路线认知简化原则,即放松路线中几何元素(路段长度、角度和形状)的准确度,以确保与用户任务相关的道路认知信息最大清晰度地展现在有限屏幕上;
The SCOOT system is a route guidance system, which can adjust green ratio, length of period and phase on real time by collecting traffic data. SCOOT系统是一种交通诱导系统,它通过采集交通数据实时地调整绿信比、周期长、相位。
Simulation indicates that the new algorithm greatly enhances the throughput of network and makes better distribution of traffic. Besides, it guarantees QoS by confining route length as well. 仿真实验表明,新算法有效地提高了网络吞吐量,很好地实现负载均衡,同时通过控制路径长度保证了服务质量。
The routing algorithm is simple, still there is no theoretical model to describe how to choose the route and calculate the path length between a pair of nodes, especially in theory to discuss the performance of source management routing algorithm. 提出了源管理路由算法的理论模型,该路由算法思想虽然简单,却没有理论模型来描述它的路由选择问题以及计算任意节点间的路径长度,尤其是从理论上来评估源管理路由算法的性能。
The numerical simulation results demonstrate that the He-Ne laser can enter into chaos by the route of periodic bifurcation and output the increasing chaotic bandwidth with increasing feedback length. 数值结果表明:氦氖激光器在单反馈下随着反馈长度的增大可通过周期态进入混沌,且输出的混沌带宽随之增大。
CPN meet the definition of small-world network, with a shorter route length, high clustering coefficient, robustness and support for explicit grouping features. CPN符合小世界网络的定义,具有较短的路由长度、较高聚集系数、鲁棒性好并支持显式分组。
The analysis of current route table and identifier mapping table shows that the length of most prefix chains is no more than two. According to this property, entries of TCAM at most need to move once or not by CAO_WTES algorithm. 在实际路由表和标识映射表中,前缀链表的长度大部分不超过2,因此,在本文提出的CAOWTES算法下,表项更新时大多移动1次,或者不需移动。
This paper presents a routing adjustment algorithm for single large flow. It decreases the largest bandwidth utilization rate on one hand, and on the other hand it guarantees QoS of the flow by confining route length of the flow adjusted within some acceptable bound. 本文提出一种针对单条流的路由调整算法,一方面降低了网络最大带宽利用率,另一方面把被调整流的路径长度限制在可接受的范围之内,从而保证了该流的服务质量。
Based on analysis of delay model, a delay function is create after considering survival time of route table, node degree and buffer queue length. A route must satisfy the delay function before data transmission. 为此,对时延模型进行分析,通过路由生存时间、节点度和缓冲区队列长度来建立时延函数,使满足时延函数的路由才进行数据传输。